Data Structures for Optimizing Programs with Explicit Parallelism

When analyzing programs with parallel imperative constructs (e.g., cobegin/coend), standard computer intermediate representations are inadequate. This paper introduces a new relation called the precedence relation and new data structures called the Pamllel Control Flow Graph and Parallel Precedence Graphs for programs with parallel constructs. We show how to report anomalies in parallel programs using Parallel Precedence Grnphs. In sequential control flow graphs, the precedence relation is represented by the dominance relation. With explicit parallelism, the dominance relation is not the same a s the precedence relation; we discuss the significance of the precedence relation and the new data structures for analyzing programs with parallel constructs. These data structures form a concrete basis for the development of efficient algorithms for optimizing parallel programs.